Additive composition formulation of the iterative Grover algorithm
نویسندگان
چکیده
منابع مشابه
Grover search algorithm
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed b...
متن کاملExactness of the Original Grover Search Algorithm
Zijian Diao Mathematics Department, Ohio University Eastern Campus, St Clairsville, OH 43950, USA∗ Abstract It is well-known that when searching one out of four, the original Grover’s search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover’s algorithm definitely not exact? In this article we gi...
متن کاملPhase Condition for the Grover Algorithm
Quantum algorithms standardly use two techniques: Fourier transforms [1] and amplitude amplification. The Grover search algorithm is based on the latter. The problem addressed by the Grover algorithm is to find a marked term (or target term in [2]) in an unsorted database of size N . To accomplish this, a quantum computer needs O (√ N ) queries using the Grover algorithm [3]. In Grover’s origin...
متن کاملDissipative decoherence in the Grover algorithm
Using the methods of quantum trajectories we study effects of dissipative decoherence on the accuracy of the Grover quantum search algorithm. The dependence on the number of qubits and dissipation rate are determined and tested numerically with up to 16 qubits. As a result, our numerical and analytical studies give the universal law for decay of fidelity and probability of searched state which ...
متن کاملStochastic Simulation of Grover ’ s Algorithm
We simulate Grover's algorithm in a classical computer by means of a stochastic method using the Hubbard-Stratonovich decomposition of n-qubit gates into one-qubit gates integrated over auxiliary fields. The problem reduces to finding the fixed points of the associated system of Langevin differential equations. The equations are obtained automatically for any number of qubits by employing a com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Physics
سال: 2019
ISSN: 0008-4204,1208-6045
DOI: 10.1139/cjp-2018-0452